Distributed Computation as Hierarchy

نویسنده

  • Michael Manthey
چکیده

This paper presents a new distributed computational model of distributed systems called the phase web that extends Vaughn Pratt’s orthocurrence relation from 1986. The model uses mutual-exclusion to express sequence, and a new kind of hierarchy to replace event sequences, posets, and pomsets. The model explicitly connects computation to a discrete Clifford algebra that is in turn extended into homology and co-homology, wherein the recursive nature of objects and boundaries becomes apparent and itself subject to hierarchical recursion. Topsy, a programming environment embodying the phase web, is currently being readied for release.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated Computation of Global Functions in a Distributed Environment

In a distributed system, many algorithms need repeated computation of a global function. These algorithms generally use a static hierarchy for gathering necessary data from all processes. As a result, they are unfair to processes at higher levels of the hierarchy, which have to perform more work than processes at lower levels do. In this paper, we present a new revolving hierarchical scheme in ...

متن کامل

Matrix Factorization using Distributed Panels on the Fujitsu APlOOO

Department of Computer Science, Australian National University, Acton, ACT 0200. AUSTRALIA E-mail: [email protected] The results of the distributed panels versions of the aloorithms on the scalar-based distributed memo y multiprocessor the Fujitsu A P1000 are given, which give significantly superior performance for distributed panels versions over the w = r versions, with optimum perfo...

متن کامل

Matrix Factorization Using Distributed Panels on the Fujitsu Ap1000

Dense linear algebra computations such as matrix factorization require the technique of`block-partitioned algorithms' for their eecient implementation on memory-hierarchy processors. For scalar-based distributed memory multiprocessors, the register, cache and oo-processor memory levels of the memory hierarchy all aaect the optimal block-partition size for such algorithms. Most studies on matrix...

متن کامل

On Termination Detection Protocols in a Mobile Distributed Computing Environment

Incorporating mobile components into a distributed system has posed new challenges to the design of distributed computation. This paper studies a fundamental problem in distributed computing, the termination detection problem, in a mobile environment. Two types of termination detection protocols already exist: the diiusion-based schemes 3, 10] and the weight-throwing schemes 6, 13, 18], that ar...

متن کامل

An Open Market-Based Architecture for Distributed Computing

One of the challenges in large scale distributed computing is to utilize the thousands of idle personal computers. In this paper, we present a system that enables users to e ortlessly and safely export their machines in a global market of processing capacity. E cient resource allocation is performed based on statistical machine pro les and leases are used to promote dynamic task placement. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.DC/9809019  شماره 

صفحات  -

تاریخ انتشار 1998